The Rocky Mountain Journal of Mathematics 33(2003), no.3, 1123-1145. VALUES OF LUCAS SEQUENCES MODULO PRIMES

نویسنده

  • ZHI-HONG SUN
چکیده

Let p be an odd prime, and a, b be two integers. It is the purpose of the paper to determine the values of u(p±1)/2(a, b) (mod p), where {un(a, b)} is the Lucas sequence given by u0(a, b) = 0, u1(a, b) = 1 and un+1(a, b) = bun(a, b) − aun−1(a, b) (n > 1). In the case a = −c2, a reciprocity law is established. As applications we obtain the criteria for p | u p−1 4 (a, b) (if p ≡ 1 (mod 4)) and for k ∈ Q0(p) and k ∈ Q1(p), where Q0(p) and Q1(p) are defined as in [10]. 1.Introduction. Let a and b be two real numbers. The Lucas sequences {un(a, b)} and {vn(a, b)} are defined as follows: (1.1) u0(a, b) = 0, u1(a, b) = 1, un+1(a, b) = bun(a, b)− aun−1(a, b) (n > 1); (1.2) v0(a, b) = 2, v1(a, b) = b, vn+1(a, b) = bvn(a, b)− avn−1(a, b) (n > 1). It is well known that (1.3) un(a, b) = 1 √ b2 − 4a (b +√b2 − 4a 2 )n − (b−√b2 − 4a 2 )n)

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Properties of Balancing and Lucas-Balancing $p$-Numbers

The main goal of this paper is to develop a new generalization of balancing and Lucas-balancing sequences namely balancing and Lucas-balancing $p$-numbers and derive several identities related to them. Some combinatorial forms of these numbers are also presented.

متن کامل

Mixing Properties of Mixed Chebyshev Polynomials

1. Robert P. Backstrom. "On the Determination of the Zeros of the Fibonacci Sequence." The Fibonacci Quarterly 4, No. 4 (1966):313-322. 2. R. D. Carmichael. "On the Numerical Factors of the Arithmetic Forms a + 3." Annals of Mathematics9 2nd Ser. 15 (1913):30-70. 3. John H. Halton. "On the Divisibility Properties of Fibonacci Numbers." The Fibonacci Quarterly 4, No. 3 (1966):217-240. 4. D.H. Le...

متن کامل

A Comparative S-Index in Factoring RSA Modulus via Lucas Sequences

General Lucas sequences are practically useful in cryptography. In the past quarter century, factoring large RSA modulo into its primes is one of the most important and most challenging problems in computational number theory. A factoring technique on RSA modulo is mainly hindered by the strong prime properties. The success of factoring few large RSA modulo within the last few decades has been ...

متن کامل

Automatic congruences for diagonals of rational functions

In this paper we use the framework of automatic sequences to study combinatorial sequences modulo prime powers. Given a sequence whose generating function is the diagonal of a rational power series, we provide a method, based on work of Denef and Lipshitz, for computing a finite automaton for the sequence modulo p, for all but finitely many primes p. This method gives completely automatic proof...

متن کامل

ARE PSEUDOPRIMES FOR ALMOST ALL PRIMES p

It was proven by Emma Lehmer that for almost all odd primes p, F2p is a Fibonacci pseudoprime. In this paper, we generalize this result to Lucas sequences {Uk}. In particular, we find Lucas sequences {Uk} for which either U2p is a Lucas pseudoprime for almost all odd primes p or Up is a Lucas pseudoprime for almost all odd primes p.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003